On the max-min pursuit game
نویسندگان
چکیده
منابع مشابه
Game Tree Searching by Min/Max Approximation
We present an iterative method for searching minlmax game trees based on the idea of approximating the “min” and “max” operators by generalized mean-valued operators. This approximation is useci to guide the selection of the next leaf node to expand, since the approximations allow one to select ejficiently that leaf node upon whose value the (approximate) value at the root most highly depends. ...
متن کاملMin-Max payoffs in a two-player location game
We consider a two-player, sequential location game in d-dimensional Euclidean space with arbitrarily distributed consumer demand. The objective for each player is to select locations so as to maximize their market share—the mass of consumers in the vicinity of their chosen locations. At each stage, the two players (Leader and Follower) choose one location each from a feasible set in sequence. W...
متن کاملOn the max min vertex cover Problem
We address the max min vertex cover problem, which is the maximization version of the well studied min independent dominating set problem, known to be NP-hard and highly inapproximable in polynomial time. We present tight approximation results for this problem on general graphs, namely a polynomial approximation algorithm which guarantees an n approximation ratio, while showing that unless P = ...
متن کاملUnifying View on Min-Max Fairness, Max-Min Fairness, and Utility Optimization in Cellular Networks
We are concerned with the control of quality of service (QoS) in wireless cellular networks utilizing linear receivers. We investigate the issues of fairness and total performance, which are measured by a utility function in the form of a weighted sum of link QoS. We disprove the common conjecture on incompatibility of min-max fairness and utility optimality by characterizing network classes in...
متن کاملDynamic Min-Max Problems
A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing. 20 2. G t is a dominating subgraph of G c as there are no edges between nodes v i 2 V ? t and v j 2 (V + nV + t), G t has a min-max potential and G c has a min potential. G t is a maximal dominating subgraph of G c. To proof this, let us suppose that a subgraph G q of G c nG t cou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1979
ISSN: 0022-247X
DOI: 10.1016/0022-247x(79)90056-8